The Condominium Problem; Auctions for Substitutes

نویسنده

  • Roberto Burguet
چکیده

This paper considers the problem of designing selling procedures for substitutes (like condominium units). I show that oral, ascending auctions for the right to choose are efficient. This is a common type of auction used for the sale of real estate. Efficiency is not optimal from the seller’s viewpoint. An optimal procedure distorts the right-tochoose auction to favor in late rounds bidders whose preferred object has already been sold. This optimal auction is complex. A revenue improving departure from efficiency can be achieved by simply auctioning all the rights to choose before any of them is exerted. This is also a common feature of auctions for the sale of real estate. JEL Classification: D44.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Optimal Strategies for Bidding Agents Participating in Simultaneous Vickrey Auctions with Perfect Substitutes

We derive optimal strategies for a bidding agent that participates in multiple, simultaneous second-price auctions with perfect substitutes. We prove that, if everyone else bids locally in a single auction, the global bidder should always place non-zero bids in all available auctions, provided there are no budget constraints. With a budget, however, the optimal strategy is to bid locally if thi...

متن کامل

An Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions

We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...

متن کامل

Achieving Simultaneous Spectrum Utilization and Revenue Improvements in Practical Wireless Spectrum Auctions

Spectrum is a valuable, scarce and finite natural resource that is needed for many different applications, so efficient use of the scarce radio spectrum is important for accommodating the rapid growth of wireless communications. Spectrum auctions are one of the best-known market-based solutions to improve the efficiency of spectrum use. However, Spectrum auctions are fundamentally differen...

متن کامل

Optimal Strategies for Simultaneous Vickrey Auctions with Perfect Substitutes

We derive optimal strategies for a bidding agent that participates in multiple, simultaneous second-price auctions with perfect substitutes. We prove that, if everyone else bids locally in a single auction, the global bidder should always place non-zero bids in all available auctions, provided there are no budget constraints. With a budget, however, the optimal strategy is to bid locally if thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004